An inexact dual logarithmic barrier method for solving sparse semidefinite programs
نویسندگان
چکیده
منابع مشابه
An inexact dual logarithmic barrier method for solving sparse semidefinite programs
A dual logarithmic barrier method for solving large, sparse semidefinite programs is proposed in this paper. The method avoids any explicit use of the primal variable X and therefore is well-suited to problems with a sparse dual matrix S. It relies on inexact Newton steps in dual space which are computed by the conjugate gradient method applied to the Schur complement of the reduced KKT system....
متن کاملAn inexact proximal point method for solving generalized fractional programs
In this paper, we present several new implementable methods for solving a generalized fractional program with convex data. They are Dinkelbach-type methods where a prox-regularization term is added to avoid the numerical difficulties arising when the solution of the problem is not unique. In these methods, at each iteration a regularized parametric problem is solved inexactly to obtain an appro...
متن کاملA randomized method for solving semidefinite programs
Proposed is a novel iterative method for solving semidefinite programs. It exploits the ideology of cutting hyperplane through the center of mass of a convex body. To estimate the center of mass, we use a random walk technique known as the Hit-and-Run algorithm. The results of numerical simulations are compared to those obtained with presently available approaches. Robust versions of the method...
متن کاملWorking Paper Solving a Class of Lp Problems with a Primal-dual Logarithmic Barrier Method Solving a Class of Lp Problems with a Primal-dual Logarithmic Barrier Method
Working Papers are interim reports on work of the International Institute for Applied Systems Analysis and have received only limited review. Views or opinions expressed herein do not necessarily represent those of the Institute or of its National Member Organizations. Foreword This Working Paper describes the implementation of an LP solver at IIASA. The primary motivation for this research was...
متن کاملSolving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
We present a dual-scaling interior-point algorithm and show how it exploits the structure and sparsity of some large scale problems. We solve the positive semideenite relaxation of combinatorial and quadratic optimization problems subject to boolean constraints. We report the rst computational results of interior-point algorithms for approximating the maximum cut semideenite programs with dimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2018
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-018-1281-5